Computability theory - PDFSEARCH.IO - Document Search Engine

Computability theory
Results: 1231

#	Item
401	The Turing Closure of an Archimedean Field Paolo Boldi∗ Sebastiano Vigna∗ Abstract Add to Reading List Source URL: vigna.di.unimi.it Language: English - Date: 2002-05-18 04:52:19 Applied mathematics Theory of computation Alan Turing Models of computation Turing machine Computability Turing degree Computable number Reduction Theoretical computer science Computability theory Computer science
402	Higher-Order and Symbolic Computation manuscript No. (will be inserted by the editor) Compilation of extended recursion in call-by-value functional languages Tom Hirschowitz · Xavier Leroy · J. B. Wells Add to Reading List Source URL: gallium.inria.fr Language: English - Date: 2009-12-15 04:49:16 Computability theory Recursion Theoretical computer science Models of computation Formal methods Lambda calculus Standard ML Free variables and bound variables Scheme Software engineering Computing Mathematics
403	λ-Calculus: Then & Now Dana S. Scott University Professor Emeritus Carnegie Mellon University Add to Reading List Source URL: logic.berkeley.edu Language: English - Date: 2014-08-24 16:43:20 Computability theory Theory of computation Lambda calculus Formal methods Models of computation Combinatory logic Church–Turing thesis Turing machine Entscheidungsproblem Mathematics Theoretical computer science Mathematical logic
404	Equality Is a Jump Paolo Boldi∗ Sebastiano Vigna∗ Dipartimento di Scienze dell’Informazione, Università degli Studi di Milano {boldi,vigna}@dsi.unimi.it Add to Reading List Source URL: vigna.di.unimi.it Language: English - Date: 2002-05-18 04:50:21 Computability theory Polynomials Turing machine Models of computation Field theory Irreducible polynomial Field extension Computability Polynomial ring Abstract algebra Mathematics Theoretical computer science
405	Higher-Order and Symbolic Computation manuscript No. (will be inserted by the editor) Compilation of extended recursion in call-by-value functional languages Tom Hirschowitz · Xavier Leroy · J. B. Wells Add to Reading List Source URL: pauillac.inria.fr Language: English - Date: 2009-12-15 04:49:16 Computability theory Recursion Theoretical computer science Models of computation Formal methods Lambda calculus Standard ML Free variables and bound variables Scheme Software engineering Computing Mathematics
406	American Computer Science LeagueClassroom Division Questions 1 -5 Add to Reading List Source URL: www.acsl.org Language: English - Date: 2011-07-30 11:53:12 Functions and mappings Computability theory Theory of computation Binary arithmetic Octal Function Primitive recursive function Lambda calculus Mathematics Mathematical logic Theoretical computer science
407	Egon Borger Erich Gradel Yuri Gurevich The Classical Decision Problem Add to Reading List Source URL: www.gbv.de Language: English - Date: 2007-11-05 08:28:23 Computability theory Model theory Complexity classes Metalogic Proof theory Decision problem Decidability Satisfiability First-order logic Theoretical computer science Computational complexity theory Mathematical logic
408	A PROBABILISTIC POLYNOMIAL-TIME PROCESS CALCULUS FOR THE ANALYSIS OF CRYPTOGRAPHIC PROTOCOLS JOHN C. MITCHELL, AJITH RAMANATHAN, ANDRE SCEDROV, AND VANESSA TEAGUE Abstract. We prove properties of a process calculus that Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2007-12-18 01:35:24 Formal methods Computability theory Lambda calculus Polynomial Π-calculus IP Process calculus Function PP Theoretical computer science Mathematics Applied mathematics
409	Terminology: Denoted and Expressed Values A denoted value is the meaning of a variable An expressed value is the result of an expression Terminology: Denoted and Expressed Values First-order functions Add to Reading List Source URL: www.cs.utah.edu Language: English - Date: 2009-02-04 16:35:18 Mathematical logic Recursion Lambda calculus Factorial Scheme Function Primitive recursive function Fixed-point combinator Mathematics Computability theory Computer programming
410	Multi-core Parallelization of Abstracted Abstract Machines ∗ Leif Andersen Matthew Might University of Utah Add to Reading List Source URL: www.schemeworkshop.org Language: English - Date: 2014-01-13 20:04:09 Formal languages Models of computation Computability theory Formal methods Lambda calculus Actor model Algorithm Regular language Semantics Theoretical computer science Mathematics Applied mathematics

UPDATE